New approaches for solving large Sylvester equations

نویسندگان

  • Davod Khojasteh Salkuyeh
  • Faezeh Toutounian
چکیده

In this paper, we propose two new algorithms based on modified global Arnoldi algorithm for solving large Sylvester matrix equations AX + XB = C where A ∈ Rn×n, B ∈ Rs×s, X and C ∈ Rn×s. These algorithms are based on the global FOM and GMRES algorithms and we call them by Global FOM-SylvesterLike(GFSL) and Global GMRES-Sylvester-Like(GGSL) algorithms, respectively. Some theoretical results and numerical examples are alsogiven. AMS Subject Classification : 65F10, 65F50.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

Theoretical results on the global GMRES method for solving generalized Sylvester matrix‎ ‎equations

‎The global generalized minimum residual (Gl-GMRES)‎ ‎method is examined for solving the generalized Sylvester matrix equation‎ ‎[sumlimits_{i = 1}^q {A_i } XB_i = C.]‎ ‎Some new theoretical results are elaborated for‎ ‎the proposed method by employing the Schur complement‎. ‎These results can be exploited to establish new convergence properties‎ ‎of the Gl-GMRES method for solving genera...

متن کامل

On the solving of matrix equation of Sylvester type

A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...

متن کامل

Gauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations

In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

متن کامل

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 173  شماره 

صفحات  -

تاریخ انتشار 2006